A Mealy Machine of Growth
نویسنده
چکیده
We consider a very simple Mealy machine (three states over a twosymbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sided ideals is a chain.
منابع مشابه
On Composite and Non-monotonic Growth Functions of Mealy Automata
Abstract. We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite nonmonotonic growth functions of the polynomial growth order. There are described examples of Mealy automata that have composite monotonic growth functions of intermediate and expon...
متن کاملA Mealy Machine with Polynomial Growth of Irrational Degree
We consider a very simple Mealy machine (two non-trivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sided...
متن کاملCoalgebraic Logic and Synthesis of Mealy Machines
We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every formula into a finite Mealy machine whose behaviour is exactly the set of causal functions satisfying the ...
متن کاملMinimization of Finite State Machines 1 Miroslava
We have formalized deterministic finite state machines closely following the textbook [9], pp. 88–119 up to the minimization theorem. In places, we have changed the approach presented in the book as it turned out to be too specific and inconvenient. Our work also revealed several minor mistakes in the book. After defining a structure for an outputless finite state machine, we have derived the s...
متن کاملMinimization of Finite State Machines1
We have formalized deterministic finite state machines closely following the textbook [10], pp. 88–119 up to the minimization theorem. In places, we have changed the approach presented in the book as it turned out to be too specific and inconvenient. Our work also revealed several minor mistakes in the book. After defining a structure for an outputless finite state machine, we have derived the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005